On the generalized approximate weak Chebyshev greedy algorithm
نویسندگان
چکیده
منابع مشابه
Approximate Weak Greedy Algorithms
We present a generalization of V. Temlyakov’s weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries. For a class of dictionaries with more structure, we give a more relaxed necessary and sufficient condition ...
متن کاملLebesgue constants for the weak greedy algorithm
We estimate the Lebesgue constants for the weak thresholding greedy algorithm in a Banach space relative to a biorthogonal system. The estimates involve the weakness (relaxation) parameter of the algorithm, as well as properties of the basis, such as its quasi-greedy constant and democracy function.
متن کاملOn Generalized Weak Structures
Avila and Molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α(g),π(g),σ(g) and β(g). This work is a further investigation of generalized weak structures due to Avila and Molina. Further we introduce the structures ro(g) and rc(g) and study the properties of the structures r...
متن کاملGeneralized Greedy Algorithm for Shortest Superstring
In the primitive greedy algorithm for shortest superstring, if a pair of strings with maximum overlap picked out, they are subsequently merged. In this paper, we introduce the concept of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced to the primitive greedy algorithm if the relative optimal set is empty. Consequently, the new algorithm achiev...
متن کاملConvergence of the weak dual greedy algorithm in Lp-spaces
We prove that the weak dual greedy algorithm converges in any subspace of a quotient of Lp when 1opoN: r 2003 Elsevier Inc. All rights reserved. A subset D of a (real) Banach space X is called a dictionary if (i) D is normalized i.e. if gAD implies jjgjj 1⁄4 1: (ii) D is symmetric i.e. D 1⁄4 D: (iii) D is fundamental i.e. 1⁄2D 1⁄4 X : Given xAX we are interested in algorithms which generate a s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Mathematica
سال: 2017
ISSN: 0039-3223,1730-6337
DOI: 10.4064/sm8579-10-2016